
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N;
const int n = 10000;
vector<long long> vv;
int sum;
int N1, N2;
int sum1, sum2;
int main()
{
    cin >> N;
    for (int i = 0; i < N; i++)
    {
        int ret;
        cin >> ret;
        sum += ret;
        vv.push_back(ret);
    }
    sort(vv.begin(), vv.end());
    for (int i = 0; i < N; i++)
    {
        if (N % 2 == 0)
        {
            if (i < N / 2)
            {
                N2++;
                sum2 += vv[i];
            }
            else
            {
                N1++;
                sum1 += vv[i];
            }

        }
        else
        {
            if (i <= (N-1) / 2 - 1)
            {
                N2++;
                sum2 += vv[i];
            }
            else
            {
                N1++;
                sum1 += vv[i];
            }
        }
        
        


    }
    int ans = abs(sum1 - sum2);
    printf("Outgoing #: %d\n", N1);
    printf("Introverted #: %d\n", N2);
    printf("Diff = %d\n", ans);
    return 0;
}
